57 research outputs found
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
The generalized 2-server problem is an online optimization problem where a sequence of requests has to be served at minimal cost. Requests arrive one by one and need to be served instantly by at least one of two servers. We consider the general model where the cost function of the two servers may be different. Formally, each server moves in its own metric space and a request consists of one point in each metric space. It is served by moving one of the two servers to its request point. Requests have to be served without knowledge of future requests. The objective is to minimize the total traveled distance. The special case where both servers move on the real line is known as the CNN problem. We show that the generalized work function algorithm, , is constant competitive for the generalized 2-server problem. Further, we give an outline for a possible extension to servers and discuss the applicability of our techniques and of the work function algorithm in general. We conclude with a discussion on several open problems in online optimization
Approximation and complexity of multi-target graph search and the Canadian traveler problem
In the Canadian traveler problem, we are given an edge weighted graph with two specified vertices s and t and a probability distribution over the edges that tells which edges are present. The goal is to minimize the expected length of a walk from s to t. However, we only get to know whether an edge is active the moment we visit one of its incident vertices. Under the assumption that the edges are active independently, we show NP-hardness on series-parallel graphs and give results on the adaptivity gap. We further show that this problem is NP-hard on disjoint-path graphs and cactus graphs when the distribution is given by a list of scenarios. We also consider a special case called the multi-target graph search problem. In this problem, we are given a probability distribution over subsets of vertices. The distribution specifies which set of vertices has targets. The goal is to minimize the expected length of the walk until finding a target. For the
The Traveling Salesman Problem Under Squared Euclidean Distances
Let be a set of points in , and let be a
real number. We define the distance between two points as
, where denotes the standard Euclidean distance between
and . We denote the traveling salesman problem under this distance
function by TSP(). We design a 5-approximation algorithm for TSP(2,2)
and generalize this result to obtain an approximation factor of
for and all .
We also study the variant Rev-TSP of the problem where the traveling salesman
is allowed to revisit points. We present a polynomial-time approximation scheme
for Rev-TSP with , and we show that Rev-TSP is APX-hard if and . The APX-hardness proof carries
over to TSP for the same parameter ranges.Comment: 12 pages, 4 figures. (v2) Minor linguistic change
Meeste kogemused perekeskse sünnitusabiga - kvalitatiivne uurimus Lääne-Tallinna Keskhaigla ja Lõuna-Eesti Haigla sünnitusosakonnas
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present a polynomial time approximation scheme for both the connected and unconnected version
The traveling salesman problem on cubic and subcubic graphs
We study the traveling salesman problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3-conjecture for metric TSP, which says that the integrality gap, i.e., the worst case ratio between the optimal value of a TSP instance and that of its linear programming relaxation (the subtour elimination relaxation), is 4/3. We present the first algorithm for cubic graphs with approximation ratio 4/3. The proof uses polyhedral techniques in a surprising way, which is of independent interest. In fact we prove constructively that for any cubic graph on TeX vertices a tour of length TeX exists, which also implies the 4/3-conjecture, as an upper bound, for this class of graph-TSP. Recently, Mömke and Svensson presented an algorithm that gives a 1.461-approximation for graph-TSP on general graphs and as a side result a 4/3-approximation algorithm for this problem on subcubic graphs, also settling the 4/3-conjecture for this class of graph-TSP. The algorithm by Mömke and Svensson is initially randomized but the authors remark that derandomization is trivial. We will present a different way to derandomize their algorithm which leads to a faster running time. All of the latter also works for multigraphs
裏表紙
textabstractIn this paper, we consider the a priori traveling salesman problem (TSP) in the scenario model. In this problem, we are given a list of subsets of the vertices, called scenarios, along with a probability for each scenario. Given a tour on all vertices, the resulting tour for a given scenario is obtained by restricting the solution to the vertices of the scenario. The goal is to find a tour on all vertices that minimizes the expected length of the resulting restricted tour. We show that this problem is already NP-hard and APX-hard when all scenarios have size four. On the positive side, we show that there exists a constant-factor approximation algorithm in three restricted cases: if the number of scenarios is fixed, if the number of missing vertices per scenario is bounded by a constant, and if the scenarios are nested. Finally, we discuss an elegant relation with an a priori minimum spanning tree problem
Split scheduling with uniform setup times
We study a scheduling problem in which jobs
may be split into parts, where the parts of a split job may be
processed simultaneously on more than one machine. Each
part of a job requires a setup time, however, on the machine
where the job part is processed. During setup, a machine
cannot process or set up any other job. We concentrate on
the basic case in which setup times are job-, machine- and
sequence-independent. Problems of this kind were encountered
when modelling practical problems in planning dis-
aster relief operations. Our main algorithmic result is a
polynomial-time algorithm for minimising total completion
time on two parallel identical machines. We argue, why the
same problem with threemachines is not an easy extension of
the two-machine case, leaving the complexity of this case as a
tantalising open problem. We give a constant-factor approximation
algorithm for the general case with any number of
machines and a polynomial-time approximation scheme for
a fixed number of machines. For the version with the objective
to minimise total weighted completion time, we prove
NP-hardness. Finally, we conclude with an overview of the
state of the art for other split scheduling problems with job-,
machine- and sequence-independent setup times
Meydlakh
I. Musical Theater11When Hearts Are YoungVen Dos Harts Iz YungTrombonecolor9.5"x12.5"ClearedMusic manuscrip
- …